An Interval Lattice-Based Constraint Solving Framework for Lattices

We present a simple generic framework to solve constraints on any domain ( nite or in nite) which has a lattice structure. The approach is based on the use of a single constraint similar to the indexicals used by CLP over nite domains and on a particular de nition of an interval lattice built from the computation domain. We provide the theoretical foundations for this framework, a schematic procedure for the operational semantics, and numerous examples illustrating how it can be used both over classical and new domains. We also show how lattice combinators can be used to generate new domains and hence new constraint solvers for these domains from existing domains.